Therapy Plans as Hierarchically Structured Graphs
نویسنده
چکیده
The paper deals with fundamentals of therapy planning in complex dynamic technological systems. Therapy plans (plans, for short) are introduced via several concepts of hierarchical graph structures. There are investigated hierarchically structured families of plans as collections of pin graphs, rooted families of plans, hierarchically structured plans, and plans itself. Emphasis is put on the integration of graph-theoretic concepts and AI applications. Knowledge-based supervision and control is investigated for a class of particularly complex dynamic processes. Therapy of malfunctions turns out to be diicult and needs suuciently exible and expressive planning concepts. These are the graph-theoretic concepts investigated. The approach allows to carefully distinguish between plans to be executed and plans to be revised. It provides the formal background for correctness and completeness concepts of certain planners. Based on this theoretical background, a prototypical planner has been implemented and tested. In fact, this planner accomplishs inductive program synthesis. This paper is intended to provide the formal concepts underlying our approach towards therapy plan generation for complex dynamic systems as outlined in Arn92]. It is particularly aimed at explaining the use of graph-theoretic concepts for applications in artiicial intelligence 1. There is a couple of variants of a planning algorithm (cf. AJ95]) based on this approach. In their right perspective, these algorithms accomplish inductive program synthesis (cf. AJ94a]). We feel the urgent need for clear notions and notations opposed to statements like \A plan in ILP 2 is taken to be a set of assumptions about the future." in Pel91], p. 132. This seems not only vague, but quite useless. In particular, deeper questions like the one whether or not a certain plan is always a sequentially structured object need some formal basis for consideration. In our application, plans are assembled upon a collection of action scripts. Those action scripts are chosen from some complex hierarchical technology representation, where elementary or compound action scripts are attached to technological objects. They represent control knowledge within the Joint Project (BMFT-Verbundprojekt) Wiscon on Development of Methods for Intelligent Monitoring and Control under contract no. 413-4001-01 IW 204 B. 1 According to a referee's request, we have reduced the investigation of graph-theoretic concepts to gain more space for illustrating the application in plan generation. This seems more appropriate for the expected audience at
منابع مشابه
Efficient generation and execution of DAG-structured query graphs
Traditional database management systems use tree-structured query evaluation plans. While easy to implement, a tree-structured query evaluation plan is not expressive enough for some optimizations like factoring common algebraic subexpressions or magic sets. These require directed acyclic graphs (DAGs), i.e. shared subplans. This work covers the different aspects of DAG-structured query graphs....
متن کاملIncremental Plan Recognition in an Agent Programming Framework
In this paper, we propose a formal model of plan recognition for inclusion in a cognitive agent programming framework. The model is based on the Situation Calculus and the ConGolog agent programming language. This provides a very rich plan specification language. Our account also supports incremental recognition, where the set of matching plans is progressively filtered as more actions are obse...
متن کاملProof Presentation Based on Proof PlansErica
The paper addresses two problems of comprehensible proof presentation, the hierarchically structured presentation at the level of proof methods and diierent presentation styles of construction proofs. It provides solutions for these problems that can make use of proof plans generated by an automated proof planner.
متن کاملHierarchical Graph Transformation
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...
متن کاملEfficient visual navigation of hierarchically structured graphs
Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierarchical structure. This structure is expressed in form of a recursive clustering of the nodes: in call graphs of telephone networks, for instance, the nodes are identified with phone numbers; they are clustered recursively through the implicit structure o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994